THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING Practical performance of the Maximum Likelihood Estimator for problems characterized by zero information points

نویسندگان

  • Bashan Eran
  • Anthony J. Weiss
چکیده

In this thesis we study issues related to estimators behavior. We examine the general scalar measurement equation yn = h(θ) + vn, from which we wish to estimate the parameter θ. Specifically, we concentrate on problems where θ is a continuous parameter and the Fisher Information Measure (FIM) equal zero at isolated points θi. The well-known Cramér-Rao Lower Bound (CRLB) on the variance of any unbiased estimator is the inverse of the FIM, hence we define the points where the FIM equal zero as singular points of the CRLB. These conditions are common in many practical applications. One such known case is the problem of Direction Of Arrival (DOA) estimation using a linear array of sensors. In the DOA problem the singularity occurs when the transmitter is located at the end-fire of the array (aligned with the array direction). Our target is to derive the statistical description of the Maximum Likelihood Estimator for the general case of singular points. Maximum Likelihood Estimators (MLE) are very popular since in many cases they are relatively easy to derive, and under regularity conditions (see section 2.2.1) known to be asymptotically unbiased and efficient. These properties led to the common belief that the MLE is useless in the vicinity of singular points of the CRLB. In this thesis we show that the MLE, for this problem, is useful over the entire parameter space. Moreover, we derive the estimator Probability Distribution Function (PDF) from which we derive expressions for its bias and Mean Square Error (MSE), specifically showing that the latter is finite. To solve the apparent contradiction with the bound specified by the CRLB we emphasize a property shared by all (asymptotically) efficient estimators, then show that the MLE does not posses this property. Furthermore, we define the vicinity where the performance of the practical MLE cannot be predicted by the CRLB but is given precisely by our statistical description. In addition, we specify the conditions under which the MLE is locally unbiased at the singular point. We demonstrate our results using three cases: Phase estimation, DOA estimation and a special polynomial case. In each example we define the singular point, derive the estimator PDF and present simulation results. Specifically, we analyze the DOA problem and show that the MSE is reasonable at the array end-fire (this allows a designer to accurately define the array search range). Moreover we provide an upper bound for the MSE at the singular point. For the special polynomial case, we present close-form expression for both the bias and MSE of the estimator. These expressions are used to emphasize the points raised in this thesis.

منابع مشابه

THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING THE ZANDMAN-SLANER SCHOOL OF GRADUATE STUDIES THE DEPARTMENT OF ELECTRICAL ENGINEERING - SYSTEMS Universal Prediction of Individual Sequences using Deterministic Finite State Machines

This thesis considers the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine. Universal prediction of individual sequences refers to a case where a single predictor predicts a sequence, and is expected to predict as good as a reference predictor that has some previous knowledge regarding the predicted sequence. The case ...

متن کامل

Tel Aviv University the Iby and Aladar Fleischman Faculty of Engineering

In a perfectly-periodic schedule, time is divided into time-slots, and each client is scheduled precisely every some predefined number of slots, called the period of that client. Periodic schedules are useful in wireless communication and other settings. The quality of a schedule is measured by the proportion between the requested and the granted periods: either the maximum over all jobs, or th...

متن کامل

The Iby and Aladar Fleischman Faculty of Engineering The Zandman -

We present an estimation of the closeness level between the distribution of RC4 keystream bytes (at some predefined locations in the stream) to a uniform distribution (over the same domain). Our estimation is based on the L1 distance between a pair of distributions over the same domain. Although learning the distance (empirically) between a distribution of a pair of consecutive bytes in the str...

متن کامل

TEL-AVIV UNIVERSITY THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING DEPARTMENT OF ELECTRICAL ENGINEERING - SYSTEMS Improved bounds on the word error probability of RA(2) codes with linear programming based decoding

This thesis deals with the linear programming based decoding algorithm of Feldman and Karger [FK02] for Repeat-Accumulate “Turbo-like” codes. We present a new structural characterization that captures the event that decoding fails. Based on this structural characterization, we develop polynomial algorithms that, given an RA(2) code, compute upper and lower bounds on the word error probability P...

متن کامل

THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING THE ZANDMAN-SLANER SCHOOL OF GRADUATE STUDIES DEPARTMENT OF ELECTRICAL ENGINEERING - SYSTEMS Approximate Top-k Queries in Sensor Networks

We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballots and items are candidates). A top-k query in such a system asks which are the k items whose global count, across all nodes in the system, is the largest. This thesis presents a Monte-Carlo algorithm that outputs, with high probability, a set of k candidates which approxima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003